Prime and Essential Prime Implicants of Boolean Functions through Cubical Representation
نویسندگان
چکیده
K Maps are generally and ideally , thought to be simplest form for obtaining solution of Boolean equations.Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws and different traits of Karnaugh Maps. Largest possible kcubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical methods. The main purpose is to make aware and utilise the advantages of cubical techniques in minimization of Logic functions. All this is done with an aim to achieve minimal cost solution.
منابع مشابه
Cubical Representation and Minimization through Cubical Technique A Tabular Approach
Tables, Boolean Laws and different traits of Karnaugh Maps are used generally to establish a solution of Boolean equations. Cubical representation is another option to help in getting a solution of equations. Largest possible k-cubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical meth...
متن کاملA New Implicit Graph Based Prime and Essential Prime Computation Technique
Implicit set manipulation techniques based on binary decision diagrams (BDD) have made possible the verification of finite state machines with state graphs too large to be built. More recently, it has been shown that these techniques could be used with success to compute the sets of prime and essential prime implicants of Boolean functions for which these sets are much too large to be explicitl...
متن کاملFUZZY MAPS AND THEIR APPLICATION IN THE SIMPLIFICATION OF FUZZY SWITCIIING FUNCTIONS by
In Boolean logic, a Karnaugh map may be regarded either as a pictorial form of a trugh table, or as an extension of the Venn diagram. However, when fuzzy logic is concerned another minimization method is required, and therefore an extension of a Karnaugh map is investigated. In this paper a new minimization algorithm is developed in order to remove the existing disadvantage of simplifying fuzzy...
متن کاملBoolean functions with long prime implicants
In this short note we introduce a class of Boolean functions defined by a minimum length of its prime implicants. We show that given a DNF one can test in polynomial time whether it represents a function from this class. Moreover, in case that the answer is affirmative we present a polynomial time algorithm which outputs a shortest DNF representation of the given function. Therefore the defined...
متن کاملOn Kernel Rule's and Prime Implicants
We draw a simple correspondence between kernel rules and prime s’mphznts. Kernel (minimal) rules play an important role in many induction techniques. Prime implicants were previously used to formally model many other problem domains, including Boolean circuit minimization and such classical AI problems as diagnosis, truth maintenance and circumscription. This correspondence allows computing ker...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013